Lévy area without approximation
نویسندگان
چکیده
On donne une estimation asymptotique de l’aire l’ensemble des points autour desquels le mouvement brownian s’enlace un grand nombre fois, et on étudie l’enlacement moyen entre plan processus Poisson grande intensité dans plan. Cela nous permet donner nouvelle définition Lévy, qui ne repose pas sur approximations linéaires par morceaux du chemin brownien.
منابع مشابه
Diffusion approximation of Lévy processes with a view towards finance
Let the (log-)prices of a collection of securities be given by a d–dimensional Lévy process Xt having infinite activity and a smooth density. The value of a European contract with payoff g(x) maturing at T is determined by E[g(XT )]. Let X̄T be a finite activity approximation to XT , where diffusion is introduced to approximate jumps smaller than a given truncation level ! > 0. The main result o...
متن کاملQueueing approximation of suprema of spectrally positive Lévy process
Let W = sup0≤t<∞(X(t)− βt), where X is a spectrally positive Lévy process with expectation zero and 0 < β < ∞. One of the main results of the paper says that for such a process X there exists a sequence of M/GI/1 queues for which stationary waiting times converge in distribution to W. The second result shows that condition (III) of Proposition 2 in the paper is not implied by all other conditio...
متن کاملAdaptive Lévy Processes and Area-Restricted Search in Human Foraging
A considerable amount of research has claimed that animals' foraging behaviors display movement lengths with power-law distributed tails, characteristic of Lévy flights and Lévy walks. Though these claims have recently come into question, the proposal that many animals forage using Lévy processes nonetheless remains. A Lévy process does not consider when or where resources are encountered, and ...
متن کاملPreferences estimation without approximation
We devise an estimation methodology which allows preferences estimation and comparative statics analysis without a reliance on Taylor’s approximations and the indirect utility function.
متن کاملApproximate clustering without the approximation
Approximation algorithms for clustering points in metric spaces is a flourishing area of research, with much research effort spent on getting a better understanding of the approximation guarantees possible for many objective functions such as k-median, k-means, and min-sum clustering. This quest for better approximation algorithms is further fueled by the implicit hope that these better approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'I.H.P
سال: 2022
ISSN: ['0246-0203', '1778-7017']
DOI: https://doi.org/10.1214/21-aihp1230